On Applying String Matching in Searching Unique Oligonucleotides
نویسنده
چکیده
In this paper we consider using string matching in finding unique, gene specific oligonucleotides, which can be used for example in genomic research involving polymerase chain reaction, gene cloning, microarray technology or antisense DNA studies. Because of the typically huge size of genomes, the practical speed of the method used is important. We tested both exact and approximate string matching methods and further developed some of them to achieve better run times. Then we used the methods seen to be the fastest to complete exhaustive unique oligonucleotide search for many of the currently sequenced genomes.
منابع مشابه
On Approximate String Matching of Unique Oligonucleotides
The current research considers the approximate string matching search for important subsequences from DNA sequences, which is essential for numerous bioinformatics computation tasks. We tested several approximate string matching algorithms and furthermore developed one for DNA data. Run times of the algorithms are important, since the amount of data is very large.
متن کاملApproximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors. Against these problems “Edit distance” and “Soundex” are two common techniques, especially the latter one is a “sound-like” method and had been applied to the LDAP server. Nevertheless, it is not adequate for certain ...
متن کاملApplying an Efficient Searching Algorithm for Intrusion Detection on Ubicom Network Processor
Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Essential to almost every intrusion detection system is the ability to search through packets and identify content that matches known attacks. In this paper, common searching algorithms (string matching, Native, Boyer Moore and pattern ...
متن کاملTechnology Beats Algorithms (in Exact String Matching)
More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the näıve algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fastest one for patterns of length up to about 50 symbols and extremely good for longer patterns and small alphabets. The algorithm compares 16 or 32 characte...
متن کاملString Matching Techniques for Searching: Algorithms and Applications Term Paper -spring 2000
Searching of Information is one of the important aspect in the computer science and varies environment, including the fast growing Internet, requires application with eeective searching technique. We'll look into several aspect on searching and introduce some string matching techniques and algorithms which will be useful in varies needs of searching.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001